Adaptive splitting for stabilizing 1-D wavelet decompositions on irregular grids

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive splitting for stabilizing 1-D wavelet decompositions on irregular grids

This paper proposes a scheme to improve the stability of wavelet decompositions on 1-D irregular grids. Wavelet transforms on irregular grids are constructed using the lifting scheme. The filters in this scheme take the structure of the grid into account. Nice as it is, however, we undoubtfully bump into numerical stability issues directly related to the irregularity of the grid. Existing stabi...

متن کامل

Quantization of adaptive 2D wavelet decompositions

Classical linear wavelet representations of images have the drawback that they are not well-suited to represent edge information. To overcome this problem, nonlinear multiresolution decompositions are being designed that can take into account the characteristics of the input signal/image. In our previous work [1, 2] we have introduced an adaptive lifting framework, that does not require bookkee...

متن کامل

Perceptual Wavelet Adaptive D

This paper introduces a novel speech enhancement system based on a wavelet denoising framework. In this system, the noisy speech is first preprocessed using a generalized spectral subtraction method to initially lower the noise level with negligible speech distortion. A perceptual wavelet transform is then used to decompose the resulting speech signal into critical bands. Threshold estimation i...

متن کامل

Vector Plots for Irregular Grids

A standard method for visualizing vector elds consists of drawing many small \glyphs" to represent the eld. This paper extends the technique from regular to curvilinear and unstructured grids. In order to achieve a uniform density of vector glyphs on nonuniformly spaced grids, the paper describes two approaches to resampling the grid data. One of the methods, an element-based resampling, can be...

متن کامل

On locally irregular decompositions of subcubic graphs

A graph G is locally irregular if every two adjacent vertices of G have different degrees. A locally irregular decomposition of G is a partition E1, ..., Ek of E(G) such that each G[Ei] is locally irregular. Not all graphs admit locally irregular decompositions, but for those who are decomposable, in that sense, it was conjectured by Baudon, Bensmail, Przyby lo and Woźniak that they decompose i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2006

ISSN: 0165-1684

DOI: 10.1016/j.sigpro.2005.11.009